Optimal Designs for Multivariate Polynomial Extrapolation
نویسندگان
چکیده
منابع مشابه
Approximate Optimal Designs for Multivariate Polynomial Regression
Abstract: We introduce a new approach aiming at computing approximate optimal designs for multivariate polynomial regressions on compact (semi-algebraic) design spaces. We use the moment-sum-of-squares hierarchy of semidefinite programming problems to solve numerically the approximate optimal design problem. The geometry of the design is recovered via semidefinite programming duality theory. Th...
متن کاملCriterion-robust Optimal Designs for Model Discrimination and Parameter Estimation: Multivariate Polynomial Regression Case
Consider the problem of discriminating between two polynomial regression models on the q-cube [−1, 1] , q ≥ 2, and estimating parameters in the models. To find designs which are efficient for both model discrimination and parameter estimation, Zen and Tsai (2002) proposed a multiple-objective optimality criterion for the univariate case. In this work, taking the same Mγ-criterion which uses wei...
متن کاملConstrained D-and D 1 -optimal Designs for Polynomial Regression
In the common polynomial regression model of degree m we consider the problem of determining the D-and D 1-optimal designs subject to certain constraints for the D 1-eeciencies in the models of degree m ? j; m ? j + 1; : : : ; m + k (m > j 0; k 0 given). We present a complete solution of these problems, which on the one hand allow a fast computation of the constrained optimal designs and on the...
متن کاملGenerating exact D-optimal designs for polynomial models
This paper compares several optimization algorithms that can be used to generate exact D-optimal designs (i.e., designs for a specified number of runs) for any polynomial model. The merits and limitations of each algorithm are demonstrated on several low-order polynomial models, with numerical results verified against analytical results. The efficiencies – with respect to estimating model param...
متن کاملApproximating optimal point configurations for multivariate polynomial interpolation
Efficient and effective algorithms are designed to compute the coordinates of nearly optimal points for multivariate polynomial interpolation on a general geometry. “Nearly optimal” refers to the property that the set of points has a Lebesgue constant near to the minimal Lebesgue constant with respect to multivariate polynomial interpolation on a finite region. The proposed algorithms range fro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1971
ISSN: 0003-4851
DOI: 10.1214/aoms/1177693442